On Newton-Raphson formulation and algorithm for displacement based structural dynamics problem with quadratic damping nonlinearity

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of reciprocal unit based on the Newton-Raphson approximation∗

A design of a reciprocal unit based on Newton-Raphson approximation is described and implemented. We present two different designs for single precisions where one of them is extremely fast but the trade-off is an increase in area. The solution behind the fast design is that the design is fully redundant.

متن کامل

An extension of Newton-Raphson power flow problem

This paper explores an idea to extend Newton–Raphson power flow problem to handle power system transmission line flow limits, by means of generation redispatch and phase shifters. We extend and reformulate the power flow so that it includes a variety of flow limits (thermal, small-signal stability, voltage difference), generation redispatch, and phase shifters. The novelty of the approach is th...

متن کامل

Improved Newton-Raphson digital image correlation method for full-field displacement and strain calculation.

The two-dimensional in-plane displacement and strain calculation problem through digital image processing methods has been studied extensively in the past three decades. Out of the various algorithms developed, the Newton-Raphson partial differential correction method performs the best quality wise and is the most widely used in practical applications despite its higher computational cost. The ...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

MILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints

In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: MATEC Web of Conferences

سال: 2017

ISSN: 2261-236X

DOI: 10.1051/matecconf/201711101004